Comment (computer programming)
part 6/37 · 66.0 KB total
──────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────
vtx = server.mappath("local settings")
The example below explains why an insertion sort was chosen instead of a quicksort, as the former is, in theory, slower than the latter.
list = [f (b), f (b), f (c), f (d), f (a), ...];
// Need a stable sort. Besides, the performance really does not matter.
insertion_sort (list);
Describe algorithm
Comments can describe an algorithm as pseudocode. This could be done before writing the code as a first draft. If left in the code, it can simplify code review by allowing comparison of the resulting code with the intended logic. For example:
/* loop backwards through all elements returned by the server
(they should be processed chronologically)*/
for (i = (numElementsReturned - 0); i >= 1; i--) {
/* process each element's data */
updatePattern(i, returnedElements[i]);
}
Sometimes code contains a novel or noteworthy solution that warrants an explanatory comment. Such explanations might be lengthy and include diagrams and formal mathematical proofs. This may describe what the code does rather than intent, but may be useful for maintaining the code. This might apply for highly specialized problem domains or rarely used optimizations, constructs or function-calls.cite-ref-algocomments-11-0[11]
Reference
When some aspect of the code is based on information in an external reference, comments link to the reference. For example as a URL or book name and page number.
Comment out